Solving Regular Constraints for Hedges and Contexts
نویسندگان
چکیده
We propose an algorithm for constraint solving over hedges and contexts built over individual, sequence, function, and context variables and flexible arity symbols, where the admissible bindings of sequence variables and context variables can be constrained to languages represented by regular hedge or regular context expressions. We identify sufficient syntactic restrictions that enable to solve such constraints by matching techniques, and describe a solving algorithm that is sound and complete.
منابع مشابه
CLP(H): Constraint logic programming for hedges
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We study algebra...
متن کاملA Rule-Based Framework for Solving Regular Context Sequence Constraints
We propose a framework for solving equational and membership constraints for terms built over individual, sequence, function, and context variables and flexible arity symbols. Each membership constraint couples a variable with a regular expression on terms or contexts. There can be several membership constraints with the same constrained variable, and expressions may contain variables themselve...
متن کاملConstraint Logic Programming for Hedges: A Semantic Reconstruction
We describe the semantics of CLP(H): constraint logic programming over hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms, for hedges, and for function symbols. Constraints involve equations between unranked terms and atoms for regular hedge language membership. We give algebraic semantics of CLP(H) programs, defin...
متن کاملResiduated Skew Lattice with a Operation
In this paper, we define hedge operation on a residuated skew lattice and investigate some its properties. We get relationships between some special sets as dense, nilpotent, idempotent, regular elements sets and their hedges. By examples, we show that hedge of a dense element is not a dense and hedge of a regular element is not a regular. Also hedge of a nilpotent element is a nilpotent and h...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کامل